2099. Find Subsequence of Length K With the Largest Sum - LeetCode Solution

class Solution:
    def maxSubsequence(self, num: List[int], k: int) -> List[int]:
        nums = sorted(num)
        dict1 = {}
        for i in range(len(nums)-1, -1, -1):
            if k==0:
                break
            if nums[i] in dict1:
                dict1[nums[i]] +=1
            else:
                dict1[nums[i]]= 1
            k-=1
        ans = []
        
        for i in num:
            if i in dict1:
                if dict1[i] !=0:
                    ans.append(i)
                    dict1[i] -=1
        return ans